The Intersection of Algorithmically Random Closed Sets and Effective Dimension

نویسندگان

چکیده

In this article, we study several aspects of the intersections algorithmically random closed sets. First, answer a question Cenzer and Weber, showing that operation intersecting relatively sets (random with respect to certain underlying measures induced by Bernoulli on space codes sets), which preserves randomness, can be inverted: set appropriate type obtained as intersection two We then extend Cenzer/Weber analysis multiple sets, identifying non-empty. lastly apply our provide characterization effective Hausdorff dimension sequences in terms degree intersectability contain them.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Algorithmically random closed sets and probability

by Logan M. Axon Algorithmic randomness in the Cantor space, 2 ω , has recently become the subject of intense study. Originally defined in terms of the fair coin measure, algorithmic randomness has since been extended, for example in Reimann and Slaman [22, 23], to more general measures. Others have meanwhile developed definitions of algorithmic randomness for different spaces, for example the ...

متن کامل

Intersection of Random Sets 3

We prove compact-randomness of the intersection of a measurable familyof compact-random sets. This generalizes results on the intersection of countable families of random sets. The main tools are given by the theory of Souslin spaces and the idea of countable separation. An example of a random set is given by the energy spectrum of an electron in a disordered solid, or more generally by the spe...

متن کامل

Random Closed Sets

We investigate notions of randomness in the space C[2] of nonempty closed subsets of {0, 1}. A probability measure is given and a version of the Martin-Löf Test for randomness is defined. Π 2 random closed sets exist but there are no random Π 1 closed sets. It is shown that a random closed set is perfect, has measure 0, and has no computable elements. A closed subset of 2 may be defined as the ...

متن کامل

Members of Random Closed Sets

The members of Martin-Löf random closed sets under a distribution studied by Barmpalias et al. are exactly the infinite paths through Martin-Löf random Galton-Watson trees with survival parameter 2 3 . To be such a member, a sufficient condition is to have effective Hausdorff dimension strictly greater than γ = log2 3 2 , and a necessary condition is to have effective Hausdorff dimension greate...

متن کامل

The Dimension of Random Ordered Sets

Let P = (X, <) be a finite ordered set and let I PI denote the cardinality of the universe X. Also let A(P) denote the maximum degree of P, i.e., the maximum number of points comparable to any one point of P. Fiiredi and Kahn used probabilistic methods to show that the dimension of P satisfies dim(P) I c,A(P) log(P1 and dim(P) 5 c,A(P) log2A(P) where c , and c, are positive absolute constants. ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: ACM Transactions on Computational Logic

سال: 2022

ISSN: ['1557-945X', '1529-3785']

DOI: https://doi.org/10.1145/3545114